Optimal Observer Path Planning For Bearings-Only Moving Targets Tracking Using Chebyshev Polynomials

Authors

Abstract:

In this paper, an optimization problem for the observer trajectory in the bearings-only surface moving target tracking (BOT) is studied. The BOT depends directly on the observability of the target's position in the target/observer geometry or the optimal observer maneuver. Therefore, the maximum lower band of the Fisher information matrix is opted as an independent criterion of the target estimator. First, modeling of the optimal control problem of the observer path is presented based on the orthogonal Chebyshev polynomial. Then, a control law for the observer direction, which is independent of the initial conditions, is obtained using the direct numerical optimization. The advantages of the proposed model include maximization of the total maneuver time, calculation of the control law at the start time of the maneuver, and high flexibility in applying the tracking constraints of the observer's motion. The efficiency of the proposed algorithm is compared with the conventional path optimization methods using the Monte Carlo. In addition, the performance of the algorithm is evaluated in different scenarios for target tracking, including remote, near, moving, and stationary, and its reliability is investigated. It is also applied in the surface submarine tracking problem using sonar.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Bearings-Only Tracking of Manoeuvring Targets Using Particle Filters

We investigate the problem of bearings-only tracking of manoeuvring targets using particle filters (PFs). Three different (PFs) are proposed for this problem which is formulated as a multiple model tracking problem in a jumpMarkov system (JMS) framework. The proposed filters are (i) multiple model PF (MMPF), (ii) auxiliary MMPF (AUX-MMPF), and (iii) jump Markov system PF (JMS-PF). The performan...

full text

Optimal Sensor Trajectories in Bearings-Only Tracking

We consider the problem of determining sensor trajectories in the bearings-only tracking of an uncertain target. This work differs from previous research in that we allow the target dynamics to be both uncertain and random; and also consider multi-sensor scenarios. The basis of our technique is to control a measure of estimation error based on the Posterior Cramér-Rao lower bound (PCRLB), and w...

full text

Formation Control and Path Planning of Two Robots for Tracking a Moving Target

This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...

full text

Bearings-Only Tracking of Manoeuvring Targets Using Multiple Model Variable Rate Particle Filter with Differential Evolution

In standard target tracking, algorithms assume synchronous and identical sampling rate for measurement and state processes. Contrary to these methods particle filter is proposed with variable rate. These filters use a restricted number of states, and a Gamma distribution is applied at state arrival time so that the maneuvering targets could be tracked. Although this structure is capable of trac...

full text

Bearings-Only Tracking in the Plane

It is known that the conditional probability density function for the general filtering problem can be represented as a path integral. This representation is the basis of a new finite dimensional recursive filter which is applied to bearings only tracking. The filter computes an approximation to the density for the target position conditional on the measurements. The approximation is accurate p...

full text

Cryptography using Chebyshev polynomials

We consider replacing the monomial xn with the Chebyshev polynomial Tn(x) in the Diffie-Hellman and RSA cryptography algorithms. We show that we can generalize the binary powering algorithm to compute Chebyshev polynomials, and that the inverse problem of computing the degree n, the discrete log problem for Tn(x) mod p, is as difficult as that for xn mod p.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 13  issue 3

pages  1- 14

publication date 2019-12

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023